Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
MAC layer scheduling strategy of roadside units based on MEC server priority service
Xin LI, Liyong BAO, Hongwei DING, Zheng GUAN
Journal of Computer Applications    2024, 44 (4): 1227-1235.   DOI: 10.11772/j.issn.1001-9081.2023050556
Abstract55)   HTML0)    PDF (3959KB)(42)       Save

Aiming at the Multi-access Edge Computing (MEC) server data transmission requirements of high reliability, low latency and large data volume, a Media Access Control (MAC) scheduling strategy based on conflict-free access, priority architecture and elastic service technology for the vehicle edge computing scenario was proposed. The proposed strategy was based on the centralized coordination of channel access rights by the Road Side Unit (RSU) of the Internet of Vehicles (IoV), which prioritized the link transmission quality between the On Board Unit (OBU) and the MEC server in the vehicle network, so that the Vehicle-to-Network (V2N) service data could be transmitted in a timely manner. At the same time, an elastic service approach was adopted for services between local OBUs to enhance the reliability of emergency message transmission when dense vehicles were accessed. First, a queuing analysis model was constructed for the scheduling strategy. Then, the embedded Markov chains were established according to the non-aftereffect characteristics of the system state variables at each moment, and the system was analyzed theoretically by the analysis method of probability generating functions to obtain the exact analytical expressions of key indicators such as the average queue length, and the average waiting latency of MEC server communication units and OBUs, and RSU query period. Computer simulation experimental results show that the statistical analysis results are consistent with the theoretical calculation results, and the proposed scheduling strategy can improve the stability and flexibility of the IoV under high load conditions.

Table and Figures | Reference | Related Articles | Metrics
Acceleration and optimization of quantum computing simulator implemented on new Sunway supercomputer
Xinmin SHI, Yong LIU, Yaojian CHEN, Jiawei SONG, Xin LIU
Journal of Computer Applications    2023, 43 (8): 2486-2492.   DOI: 10.11772/j.issn.1001-9081.2022091456
Abstract432)   HTML59)    PDF (2000KB)(447)       Save

Two optimization methods for quantum simulator implemented on Sunway supercomputer were proposed aiming at the problems of gradual scaling of quantum hardware and insufficient classical simulation speed. Firstly, the tensor contraction operator library SWTT was reconstructed by improving the tensor transposition strategy and computation strategy, which improved the computing kernel efficiency of partial tensor contraction and reduced redundant memory access. Secondly, the balance between complexity and efficiency of path computation was achieved by the contraction path adjustment method based on data locality optimization. Test results show that the improvement method of operator library can improve the simulation efficiency of the "Sycamore" quantum supremacy circuit by 5.4% and the single-step tensor contraction efficiency by up to 49.7 times; the path adjustment method can improve the floating-point efficiency by about 4 times with the path computational complexity inflated by a factor of 2. The two optimization methods have the efficiencies of single-precision and mixed-precision floating-point operations for the simulation of Google’s 53-bit, 20-layer quantum chip random circuit with a million amplitude sampling improved from 3.98% and 1.69% to 18.48% and 7.42% respectively, and reduce the theoretical estimated simulation time from 470 s to 226 s for single-precision and 304 s to 134 s for mixed-precision, verifying that the two methods significantly improve the quantum computational simulation speed.

Table and Figures | Reference | Related Articles | Metrics
Remora optimization algorithm based on chaotic host switching mechanism
Heming JIA, Shanglong LI, Lizhen CHEN, Qingxin LIU, Di WU, Rong ZHENG
Journal of Computer Applications    2023, 43 (6): 1759-1767.   DOI: 10.11772/j.issn.1001-9081.2022060901
Abstract290)   HTML8)    PDF (1965KB)(182)       Save

The optimization process of Remora Optimization Algorithm (ROA) includes three modes: attaching to host, empirical attack and host foraging, and the exploration ability and exploitation ability of this algorithm are relatively strong. However, because the original algorithm switches the host through empirical attack, it will lead to the poor balance between exploration and exploitation, slow convergence and being easy to fall into local optimum. Aiming at the above problems, a Modified ROA (MROA) based on chaotic host switching mechanism was proposed. Firstly, a new host switching mechanism was designed to better balance the abilities of exploration and exploitation. Then, in order to diversify the initial hosts of remora, Tent chaotic mapping was introduced for population initialization to further optimize the performance of the algorithm. Finally, MROA was compared with six algorithms such as the original ROA and Reptile Search Algorithm (RSA) in the CEC2020 test functions. Through the analysis of the experimental results, it can be seen that the best fitness value, average fitness value and fitness value standard deviation obtained by MROA are better than those obtained by ROA, RSA, Whale Optimization Algorithm (WOA), Harris Hawks Optimization (HHO) algorithm, Sperm Swarm Optimization (SSO) algorithm, Sine Cosine Algorithm (SCA), and Sooty Tern Optimization Algorithm (STOA) by 28%, 33%, and 12% averagely and respectively. The test results based on CEC2020 show that MROA has good optimization ability, convergence ability and robustness. At the same time, the effectiveness of MROA in engineering problems was further verified by solving the design problems of welded beam and multi-plate clutch brake.

Table and Figures | Reference | Related Articles | Metrics
Multi-channel pathological image segmentation with gated axial self-attention
Zhi CHEN, Xin LI, Liyan LIN, Jing ZHONG, Peng SHI
Journal of Computer Applications    2023, 43 (4): 1269-1277.   DOI: 10.11772/j.issn.1001-9081.2022030333
Abstract328)   HTML6)    PDF (4014KB)(117)       Save

In Hematoxylin-Eosin (HE)-stained pathological images, the uneven distribution of cell staining and the diversity of various tissue morphologies bring great challenges to automated segmentation. Traditional convolutions cannot capture the correlation features between pixels in a large neighborhood, making it difficult to further improve the segmentation performance. Therefore, a Multi-Channel Segmentation Network with gated axial self-attention (MCSegNet) model was proposed to achieve accurate segmentation of nuclei in pathological images. In the proposed model, a dual-encoder and decoder structure was adopted, in which the axial self-attention encoding channel was used to capture global features, while the convolutional encoding channel based on residual structure was used to obtain local fine features. The feature representation was enhanced by feature fusion at the end of the encoding channel, providing a good information base for the decoder. And in the decoder, segmentation results were gradually generated by cascading multiple upsampling modules. In addition, the improved hybrid loss function was used to alleviate the common problem of sample imbalance in pathological images effectively. Experimental results on MoNuSeg2020 public dataset show that the improved segmentation method is 2.66 percentage points and 2.77 percentage points higher than U-Net in terms of F1-score and Intersection over Union (IoU) indicators, respectively, and effectively improves the pathological image segmentation effect and the reliability of clinical diagnosis.

Table and Figures | Reference | Related Articles | Metrics
EEG classification based on channel selection and multi-dimensional feature fusion
Shuying YANG, Haiming GUO, Xin LI
Journal of Computer Applications    2023, 43 (11): 3418-3427.   DOI: 10.11772/j.issn.1001-9081.2022101590
Abstract322)   HTML10)    PDF (3363KB)(191)       Save

To solve the problems of the mutual interference of multi-channel ElectroEncephaloGraphy (EEG), the different classification results caused by individual differences, and the low recognition rate of single domain features, a method of channel selection and feature fusion was proposed. Firstly, the acquired EEG was preprocessed, and the important channels were selected by using Gradient Boosting Decision Tree (GBDT). Secondly, the Generalized Predictive Control (GPC) model was used to construct the prediction signals of important channels and distinguish the subtle differences among multi-dimensional correlation signals, then the SE-TCNTA (Squeeze and Excitation block-Temporal Convolutional Network-Temporal Attention) model was used to extract temporal features between different frames. Thirdly, the Pearson correlation coefficient was used to calculate the relationship between channels, the frequency domain features of EEG and the control values of prediction signals were extracted as inputs, the spatial graph structure was established, and the Graph Convolutional Network (GCN) was used to extract the features of frequency domain and spatial domain. Finally, the above two features were input to the fully connected layer for feature fusion in order to realize the classification of EEG. Experimental results on public dataset BCICIV_2a show that in the case of channel selection, compared with the first EEG-inception model for ERP detection and DSCNN (Shallow Double-branch Convolutional Neural Network) model that also uses double branch feature extraction, the proposed method has the classification accuracy increased by 1.47% and 1.69% respectively, and has the Kappa value increased by 1.25% and 2.53% respectively. The proposed method can improve the classification accuracy of EEG and reduce the influence of redundant data on feature extraction, so it is more suitable for Brain-Computer Interface (BCI) systems.

Table and Figures | Reference | Related Articles | Metrics
General multi-unit false-name-proof auction mechanism for cloud computing
Kun YOU, Qinhui WANG, Xin LI
Journal of Computer Applications    2023, 43 (11): 3351-3357.   DOI: 10.11772/j.issn.1001-9081.2022111705
Abstract120)   HTML9)    PDF (1731KB)(55)       Save

Aiming at the problem of resource auction mechanism in cloud environment, a more General multi-unit FAlse-name-proof auction mechanism for vIrTual macHine allocation (GFAITH) was studied and designed. First, the system model was formally defined. Then, around the design goals of being truthfulness and false-name-proof, it was proved that when considering the diversity of user demands, a new form of cheating, Demand-Reduction (DR) cheating, would emerge, which could destroy the truthful and false-name-proof properties, and the experimental results show that it would seriously affect the system performance. Based on the above, the GFAITH was proposed to achieve the design goals in three stages: user pre-processing, pre-allocation and pricing, and resisting demand reduction cheating. It is theoretical proved that the resource allocation of GFAITH is feasible and able to resist false-name-proof. Experimental results show that GFAITH can effectively guarantee the performance of the system from indicators such as revenue and social wealth, verifying the effectiveness and efficiency of the proposed mechanism.

Table and Figures | Reference | Related Articles | Metrics
Long-tailed image defect detection based on gradient-guide weighted-deferred negative gradient decay loss
Wei LI, Sixin LIANG, Jianzhou ZHANG
Journal of Computer Applications    2023, 43 (10): 3267-3274.   DOI: 10.11772/j.issn.1001-9081.2022091413
Abstract200)   HTML5)    PDF (2403KB)(127)       Save

Aiming at the problem that the current image defect detection models have poor detection effect on tail categories in long-tail defect datasets, a GGW-DND Loss (Gradient-Guide Weighted-Deferred Negative Gradient decay Loss) was proposed. First, the positive and negative gradients were re-weighted according to the cumulative gradient ratio of the classification nodes in the detector in order to reduce the suppressed state of tail classifier. Then, once the model was optimized to a certain stage, the negative gradient generated by each node was sharply reduced to enhance the generalization ability of the tail classifier. Experimental results on the self-made image defect dataset and NEU-DET (NEU surface defect database for Defect dEtection Task) show that the mean Average Precision (mAP) for tail categories of the proposed loss is better than that of Binary Cross Entropy Loss (BCE Loss), the former is increased by 32.02 and 7.40 percentage points respectively, and compared with EQL v2 (EQualization Loss v2), the proposed loss has the mAP increased by 2.20 and 0.82 percentage points respectively, verifying that the proposed loss can effectively improve the detection performance of the network for tail categories.

Table and Figures | Reference | Related Articles | Metrics
Survey of data-driven intelligent cloud-edge collaboration
Pengxin TIAN, Guannan SI, Zhaoliang AN, Jianxin LI, Fengyu ZHOU
Journal of Computer Applications    2023, 43 (10): 3162-3169.   DOI: 10.11772/j.issn.1001-9081.2022091418
Abstract562)   HTML29)    PDF (1772KB)(397)       Save

With the rapid development of Internet of Things (IoT), a large amount of data generated in edge scenarios such as sensors often needs to be transmitted to cloud nodes for processing, which brings huge transmission cost and processing delay. Cloud-edge collaboration provides a solution for these problems. Firstly, on the basis of comprehensive investigation and analysis of the development process of cloud-edge collaboration, combined with the current research ideas and progress of intelligent cloud-edge collaboration, the data acquisition and analysis, computation offloading technology and model-based intelligent optimization technology in cloud edge architecture were analyzed and discussed emphatically. Secondly, the functions and applications of various technologies in intelligent cloud-edge collaboration were analyzed deeply from the edge and the cloud respectively, and the application scenarios of intelligent cloud-edge collaboration technology in reality were discussed. Finally, the current challenges and future development directions of intelligent cloud-edge collaboration were pointed out.

Table and Figures | Reference | Related Articles | Metrics
Software quality evaluation method considering decision maker’s psychological behaviors
Yanhao SUN, Wei XU, Tao ZHANG, Ningxin LIU
Journal of Computer Applications    2022, 42 (8): 2528-2533.   DOI: 10.11772/j.issn.1001-9081.2021060999
Abstract249)   HTML2)    PDF (611KB)(56)       Save

Aiming at the lack of consideration of the psychological behaviors of decision makers in software quality evaluation methods, a TOmada de Decisao Interativa e Multicritevio (TODIM) software quality evaluation method based on interval 2-tuple linguistic information was proposed. Firstly, interval 2-tuple linguistic information was used to characterize the evaluation information of experts for software quality. Secondly, the subjective and objective weights of software quality attributes were calculated by subjective weighting method and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) respectively. On this basis, the comprehensive weights of software quality attributes were obtained by combined weighting method. Thirdly, in order to better describe the psychological behaviors of experts in the process of software quality evaluation, TODIM was introduced into software quality evaluation. Finally, the method was used to evaluate the software quality of assistant dispatcher terminal in high-speed railway dispatching system. The result shows that the third assistant dispatcher terminal software provided by the railway software supplier has the highest dominance value and its quality is the best. The results of comparing this method with the regret theory and Preference Ranking Organization METHod for Enrichment Evaluations (PROMETHEE-II) show that the three methods are consistent in the selection of the best quality software, but the overall rankings of the three methods are somewhat different, indicating that the constructed method has strong superiority in describing the interaction between multiple criteria and the psychological behaviors of decision makers.

Table and Figures | Reference | Related Articles | Metrics
Capsule network knowledge graph embedding model based on relational memory
Heng CHEN, Siyi WANG, Zhengguang LI, Guanyu LI, Xin LIU
Journal of Computer Applications    2022, 42 (7): 1985-1992.   DOI: 10.11772/j.issn.1001-9081.2021050764
Abstract391)   HTML22)    PDF (1243KB)(218)       Save

As a semantic knowledge base, Knowledge Graph (KG) uses structured triples to store real-world entities and their internal relationships. In order to infer the missing real triples in the knowledge graph, considering the strong triple representation ability of relational memory network and the powerful feature processing ability of capsule network, a knowledge graph embedding model of capsule network based on relational memory was proposed. First, the encoding embedding vectors were formed through the potential dependencies between encoding entities and relationships and some important information. Then, the embedding vectors were convolved with the filter to generate different feature maps, and the corresponding capsules were recombined. Finally, the connections from the parent capsule to the child capsule was specified through the compression function and dynamic routing, and the confidence coefficient of the current triple was estimated by the inner product score between the child capsule and the weight. Link prediction experimental results show that compared with CapsE model, on the Mean Reciprocal Rank (MRR) and Hit@10 evaluation indicators, the proposed model has the increase of 7.95% and 2.2 percentage points respectively on WN18RR dataset, and on FB15K-237 dataset, the proposed model has the increase of 3.82% and 2 percentage points respectively. Experiments results show that the proposed model can more accurately infer the relationship between the head entity and the tail entity.

Table and Figures | Reference | Related Articles | Metrics
Hybrid beamforming method with high spectral efficiency for unmanned aerial vehicle patrol system
Xin LING, Minzheng LI
Journal of Computer Applications    2022, 42 (3): 980-984.   DOI: 10.11772/j.issn.1001-9081.2021030445
Abstract209)   HTML7)    PDF (596KB)(54)       Save

With the development of smart power grid, Unmanned Aerial Vehicles (UAVs) are more and more widely used for inspection of transmission lines. In order to effectively implement fault location and type judgment of transmission lines, UAVs are required to transmit videos and images with high resolution. Under the condition of limited bandwidth, it is necessary to improve the spectral efficiency of UAV return communication link as much as possible to meet the transmission rate requirements of high-resolution videos and images. A video image transmission communication method based on mesh network was proposed. By deploying the wireless access nodes on tower and building Mesh network, the communication devices carried by UAVs could communicate with the built Mesh network as the network nodes at any time. After capturing a video of the failure on transmission lines the video could be quickly transmitted to the data center by UAVs. For this purpose, the communication module of the patrol UAV was equipped with a large-scale antenna array, in millimeter wave frequency band a heuristic point-to-point directional hybrid beamforming method was adopted to improve the spectral efficiency of receiving communication link. The simulation results show that the performance of the proposed method is better than that of the Orthogonal Matching Pursuit (OMP) method and is closer to that of the fully digital beamforming method.

Table and Figures | Reference | Related Articles | Metrics
Deep fusion model for predicting differential gene expression by histone modification data
Xin LI, Tao JIA
Journal of Computer Applications    2022, 42 (11): 3404-3412.   DOI: 10.11772/j.issn.1001-9081.2021111956
Abstract265)   HTML8)    PDF (1734KB)(153)       Save

Concering the problem that the Cell type?Specificity (CS) and similarity and difference information between different cell types are not properly used when predicting Differential Gene Expression (DGE) with large?scale Histone Modification (HM) data, as well as large volume of input and high computational cost, a deep learning?based method named dcsDiff was proposed. Firstly, multiple AutoEncoders (AEs) and Bi?directional Long Short?Term Memory (Bi?LSTM) networks were introduced to reduce the dimensionality of HM signals and model them to obtain the embedded representation. Then, multiple Convolutional Neural Networks (CNNs) were used to mine the HM combined effects in each single cell type, and the similarity and difference information of each HM and joint effects of all HMs between two cell types. Finally, the two kinds of information were fused to predict DGE between two cell types. In the comparison experiments with DeepDiff on 10 pairs of cell types in the REMC (Roadmap Epigenomics Mapping Consortium) database, the Pearson Correlation Coefficient (PCC) of dcsDiff in DGE prediction was increased by 7.2% at the highest and 3.9% on average, the number of differentially expressed genes accurately detected by dcsDiff was increased by 36 at most and 17.6 on average, and the running time of dcsDiff was saved by 78.7%. The validity of reasonable integration of the above two kinds of information was proved in the component analysis experiment. The parameters of dcsDiff were also determined by experiments. Experimental results show that the proposed dcsDiff can effectively improve the efficiency of DGE prediction.

Table and Figures | Reference | Related Articles | Metrics
Color image demosaicking network based on inter-channel correlation and enhanced information distillation
Hengxin LI, Kan CHANG, Yufei TAN, Mingyang LING, Tuanfa QIN
Journal of Computer Applications    2022, 42 (1): 245-251.   DOI: 10.11772/j.issn.1001-9081.2021010127
Abstract274)   HTML7)    PDF (1841KB)(78)       Save

In commercial digital cameras, due to the limitation of Complementary Metal Oxide Semiconductor (CMOS) sensors, there is only one color channel information for each pixel in the sampled image. Therefore, the Color image DeMosaicking (CDM) algorithm is required to restore the full-color images. However, most of the existing Convolutional Neural Network (CNN)-based CDM algorithms cannot achieve satisfactory performance with relatively low computational complexity and small network parameter number. To solve this problem, a CDM network based on Inter-channel Correlation and Enhanced Information Distillation (ICEID) was proposed. Firstly, to fully utilize the inter-channel correlation of the color image, an inter-channel guided reconstruction structure was designed to obtain the initial CDM result. Secondly, an Enhanced Information Distillation Module (EIDM), which can effectively extract and refine features from image with relatively small parameter number, was presented to enhance the reconstructed full-color image in high efficiency. Experimental results demonstrate that compared with many state-of-the-art CDM methods, the proposed algorithm achieves significant improvement in both objective quality and subjective quality, and has relatively low computational complexity and small network parameter number.

Table and Figures | Reference | Related Articles | Metrics
Design and implementation of cloud native massive data storage system based on Kubernetes
Fuxin LIU, Jingwei LI, Yihong WANG, Lin LI
Journal of Computer Applications    2020, 40 (2): 547-552.   DOI: 10.11772/j.issn.1001-9081.2019101732
Abstract746)   HTML20)    PDF (560KB)(568)       Save

Aiming at the sharp increasing of data on the cloud caused by the development and popularization of cloud native technology as well as the bottlenecks of the technology in performance and stability, a Haystack-based storage system was proposed. With the optimization in service discovery, automatic fault tolerance and caching mechanism, the system is more suitable for cloud native business and meets the growing and high-frequent file storage and read/write requirements of the data acquisition, storage and analysis industries. The object storage model used by the system satisfies the massive file storage with high-frequency reads and writes. A simple and unified application interface is provided for business using the storage system, a file caching strategy is applied to improve the resource utilization, and the rich automated tool chain of Kubernetes is adopted to make this storage system easier to deploy, easier to expand, and more stable than other storage systems. Experimental results indicate that the proposed storage system has a certain performance and stability improvement compared with the current mainstream object storage and file systems in the situation of large-scale fragmented data storage with more reads than writes.

Table and Figures | Reference | Related Articles | Metrics
Canny edge detection algorithm based on robust principal component analysis
NIU Fafa CHEN Li ZHANG Yongxin LI Qin
Journal of Computer Applications    2014, 34 (6): 1727-1730.   DOI: 10.11772/j.issn.1001-9081.2014.06.1727
Abstract231)      PDF (680KB)(480)       Save

To improve the accuracy and robustness of image edge detection, a new Canny edge detection algorithm based on Robust Principal Component Analysis (RPCA) was proposed. The image was decomposed into a principal component and a sparse component by RPCA. Then edge information of the principal component was extracted by Canny operator. The proposed algorithm formulated the problem of image edge detection as the edge detection of the principal component of the image. It eliminated the interference of image "stain" on the detection results and suppressed the noise. The experimental results show that the proposed algorithm outperforms Log, Canny and Susan edge detection algorithms in terms of both accuracy and robustness.

Reference | Related Articles | Metrics
Personalized recommendation algorithm integrating roulette walk and combined time effect
ZHAO Ting XIAO Ruliang SUN Cong CHEN Hongtao LI Yuanxin LI Hongen
Journal of Computer Applications    2014, 34 (4): 1114-1117.   DOI: 10.11772/j.issn.1001-9081.2014.04.1114
Abstract508)      PDF (790KB)(452)       Save

The traditional graph-based recommendation algorithm neglects the combined time factor which results in the poor recommendation quality. In order to solve this problem, a personalized recommendation algorithm integrating roulette walk and combined time effect was proposed. Based on the user-item bipartite graph, the algorithm introduced attenuation function to quantize combined time factor as association probability of the nodes; Then roulette selection model was utilized to select the next target node according to those associated probability of the nodes skillfully; Finally, the top-N recommendation for each user was provided. The experimental results show that the improved algorithm is better in terms of precision, recall and coverage index, compared with the conventional PersonalRank random-walk algorithm.

Reference | Related Articles | Metrics
Satellite terminal bursty traffic model and queuing performance analysis
BIE Yuxia ZHAN Zhaxin LIU Haiyan
Journal of Computer Applications    2014, 34 (4): 958-962.   DOI: 10.11772/j.issn.1001-9081.2014.04.0958
Abstract517)      PDF (678KB)(370)       Save

With the increase of application of satellite networks in emergency communication, and continuous growth of satellite terminal service types, the traffic may experience an instant augmentation showing a significant burst, and the data flow on the terminal also presents self-similarity. A method was propsed to generate satellite terminal self-similar traffic flow by using a superposition ON/OFF model with heavy-tailed distribution of time interval. And the effect of input of self-similar traffic flow on the packet loss rate, delay, and delay jitter was discussed, as well as the requirements on effective bandwidth. The relationship between packet loss rate at network terminal, delay, delay jitter and system cache was obtained by simulation, based on which, a method was put forward to reduce delay and decrease packet loss rate, providing theoretical support for efficient information transmission under condition of limited bandwidth and system cache.

Reference | Related Articles | Metrics
Shopping information extraction method based on rapid construction of template
LI Ping ZHU Jianbo ZHOU Lixin LIAO Bin
Journal of Computer Applications    2014, 34 (3): 733-737.   DOI: 10.11772/j.issn.1001-9081.2014.03.0733
Abstract401)      PDF (888KB)(750)       Save

Concerning the shopping information Web page constructed by template, and the large number of Web information and complex Web structure, this paper studied how to extract the shopping information from the Web page template by not using the complex learning rule. The paper defined the Web page template and the extraction template of Web page and designed template language that was used to construct the template. This paper also gave a model of extraction based on template. The experimental results show that the recall rate of the proposed method is 12% higher than the Extraction problem Algorithm (EXALG) by testing the standard 450 Web pages; the results also show that the recall rate of this method is 7.4% higher than Visual information and Tag structure based wrapper generator (ViNTs) method and 0.2% higher than Augmenting automatic information extraction with visual perceptions (ViPER) method and the accuracy rate of this method is 5.2% higher than ViNTs method and 0.2% higher than ViPER method by testing the standard 250 Web pages. The recall rate and the accuracy rate of the extraction method based on the rapid construction template are improved a lot which makes the accuracy of the Web page analysis and the recall rate of the information in the shopping information retrieval and the shopping comparison system improve a lot .

Related Articles | Metrics
Seizure detection based on max-relevance and min-redundancy criteria and extreme learning machine
ZHANG Xinjing XU Xin LING Zhipei HUANG Yongzhi WANG Shouyan WANG Xinzui
Journal of Computer Applications    2014, 34 (12): 3614-3617.  
Abstract183)      PDF (586KB)(655)       Save

The seizure detection is important for the localization and classification of epileptic seizures. In order to solve the problem brought by large amount of data and high feature space in EEG (Electroencephalograph) for quickly and accurately detecting the seizures, a method based on max-Relevance and Min-Redundancy (mRMR) criteria and Extreme Learning Machine (ELM) was proposed. The time-frequency measures by Short-Time Fourier Transform (STFT) were extracted as features, and the large set of features were selected based on max-relevance and min-redundancy criteria. The states were classified using the extreme learning machine, Support Vector Machine (SVM) and Back Propagation (BP) algorithm. The result shows that the performance of ELM is better than SVM and BP algorithms in terms of computation time and classification accuracy. The classification accuracy rate of interictal durations and seizures can reach more than 98%, and the computation efficiency is only 0.8s. This approach can detect epileptic seizures accurately in real-time.

Reference | Related Articles | Metrics
Modified method for wavelet neural network model
ZHANG Yanliang CHEN Xin LI Yadong
Journal of Computer Applications    2013, 33 (11): 3107-3110.  
Abstract527)      PDF (757KB)(348)       Save
To improve the performance of Wavelet Neural Network (WNN) model in dealing with complex nonlinear problems, concerning the shortcomings of premature convergence, poor late diversity, poor search accuracy of Quantum-behaved Particle Swarm Optimization (QPSO) algorithm, a modified quantum-behaved particle swarm algorithm was proposed for WNN training by introducing weighting coefficients, introducing Cauchy random number, improving contraction-expansion coefficient and introducing natural selection at the same time. And then, it replaced the gradient descent method with the modified quantum-behaved particle swarm algorithm, trained the wavelet coefficients and network weights, and then input the optimized combination of parameters into wavelet neural network to achieve the algorithm coupling. The simulation results on three UCI standard datasets show that the running time of the Modified Quantum-behaved Particle Swarm Optimization-Wavelet Neural Network (MQPSO-WNN) was reduced by 11%~43%, while the calculation error was decreased by 8%~57%, compared with wavelet neural network, PSO-WNN and QPSO-WNN. Therefore, the MQPSO-WNN model can approximate the optimal value more quickly and more accurately.
Related Articles | Metrics
Auto-clustering algorithm based on compute unified device architecture and gene expression programming
DU Xin LIU Dagang ZHANG Kaihuo SHEN Yuan ZHAO Kang NI Youcong
Journal of Computer Applications    2013, 33 (07): 1890-1893.   DOI: 10.11772/j.issn.1001-9081.2013.07.1890
Abstract913)      PDF (718KB)(531)       Save
There are two inefficient steps in GEP-Cluster algorithm: one is screening and aggregation of clustering centers and the other is the calculation of distance between data objects and clustering centers. To solve the inefficiency, an auto-clustering algorithm based on Compute Unified Device Architecture (CUDA) and Gene Expression Programming (GEP), named as CGEP-Cluster, was proposed. Specifically, the screening, and aggregation of clustering center step was improved by Gene Read & Compute Machine (GRCM) method, and CUDA was used to parallel the calculation of distance between data objects and clustering centers. The experimental results show that compared with GEP-Cluster algorithm, CGEP-Cluster algorithm can speed up by almost eight times when the scale of data objects is large. CGEP-Cluster can be used to implement automatic clustering with the clustering number unknown and large data object scale.
Reference | Related Articles | Metrics
Humanoid robot gait planning based on 3D linear inverted pendulum model
YU Guo-chen LIU Yong-xin LI Xiao-hong
Journal of Computer Applications    2012, 32 (09): 2643-2647.   DOI: 10.3724/SP.J.1087.2012.02643
Abstract1169)      PDF (816KB)(656)       Save
In order to real-time adjust the humanoid robot gait, a humanoid robot gait generation method was proposed. The robot motion was simplified to the inverted pendulum motion of the three-dimensional linear model, and passed the pre-planned Zero Moment Point (ZMP) trajectory. According to the Center of Mass (CoM) and ZMP relations, the CoM trajectory was obtained. The front side gait and lateral gait were simplified into seven-link and five-link structures, the triangle theorem was used to calculate the angle of each joint, and the ZMP equation was introduced to discuss the stability of the walking process. The system simulation was done according to given conditions and combined with the actual system and its operation conditions were analyzed to verify the validity of the proposed planning method.
Reference | Related Articles | Metrics
Name disambiguation based on query expansion
YANG Xin-xin LI Pei-feng ZHU Qiao-ming
Journal of Computer Applications    2012, 32 (09): 2488-2490.   DOI: 10.3724/SP.J.1087.2012.02488
Abstract869)      PDF (613KB)(568)       Save
Taking into account that many existing name disambiguation approaches are not suitable for documents with few features, this paper put forward a method that can get more features related to documents through search engine extension with the help of rich Internet resources. Firstly, four types of queries were constructed according to the characteristics of the search engine rules, and then search was done based on those query rules and the first k documents were returned. Lastly, a feature selection method of Document Frequency (DF) was used in these documents and the selected features were added to the original documents. The experimental results show that the query expansion approach can improve the performance of name disambiguation and make F-measure increase from 76% to 81%.
Reference | Related Articles | Metrics
Network congestion status prediction with multidimensional statistical methods
WU Ping WU Bin LI Xin LI Jun HUANG Hong-wei
Journal of Computer Applications    2012, 32 (05): 1251-1254.  
Abstract781)      PDF (1824KB)(720)       Save
For evaluating the two values of the average queue length and the queue waiting time, the core indicators of congestion control algorithms, more accurately in the network with priority scheduling service, a computational model, which includes the data arriving process, the data leaving process and the priority scheduling service, was designed by using the three statistical methods: the Pareto distribution, the Poisson random process and the weighted average method. And the computational function of curve shape parameter was deduced by using the matrix method. By comparing the simulation results produced from a test bed with the results of the computational model, it is found that the deviation is small, which proves that the new model can predict the status of network correctly.
Reference | Related Articles | Metrics
Cross-layer resource allocation algorithm of MIMO-OFDM systems with partial channel state information
HUANG Yu-qing LI Cheng-xin LI Qiang
Journal of Computer Applications    2012, 32 (05): 1211-1216.  
Abstract1131)      PDF (2936KB)(739)       Save
Cross-layer design is an effective technique for future mobile communication systems. A cross-layer resource allocation algorithm with partial channel state information was explored to maximize the total system throughput for multi-user MIMO-OFDM (Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing) system. The objective function of the optimization problem was designed based on the power limitation constraint, transmission rate, average queue length and sub-carrier occupancy, Quality of Service (QoS) requirements of different services and queue state information of data link layer. Under the condition of finite-length user buffer in data link layer, the mean feedback model was utilized to describe the feedback process of channel state information, and then the corresponding cross-layer resource allocation criteria could be derived. The simulation results show that compared with the existing schemes, the proposed algorithms obtain reasonable throughput performance and reduce lost package rate while providing better QoS requirement for each user of different services.
Reference | Related Articles | Metrics
ID-based non-interactive deniable authentication protocol
LI Zhi-min XU Xin LI Cun-hua
Journal of Computer Applications    2012, 32 (02): 465-471.  
Abstract921)      PDF (675KB)(380)       Save
Non-interactive deniable authentication protocol can enable the receiver to identify the source of a received message and prevent a third party from identifying the source of the message, which is very suitable to be used in E-commerce and E-government. Based on computational Diffie-Hellman assumption, using bilinear pairing, a new identity-based deniable authentication protocol was constructed. The security of the scheme was proved under the random oracle model. The analytical results show that the new proposed protocol can resist the forgery attack, spoofing attack, middle attack and replay attack. This protocol is identity-based, which means it needs no certificate and has a simple key management. On the other hand, it is efficient in communications and computation, and its implementation is simple, so that it could be implemented in mobile devices with low power and small processor.
Reference | Related Articles | Metrics
ID-based public verifiability signcryption scheme
LI Zhi-min XU Xin LI Cun-hua
Journal of Computer Applications    2012, 32 (01): 99-103.   DOI: 10.3724/SP.J.1087.2012.00099
Abstract998)      PDF (830KB)(743)       Save
Using bilinear pairing, a new identity-based signcryption scheme was proposed in this paper. Under the assumption that the Computational Diffie-Hellman (CDH) problem is hard, the newly proposed scheme had been proved to be secure against the existing unforgeability on adaptively chosen message/ciphertext and identity attack in random oracle model. The advantage of the proposed scheme is that it is identity-based which needs no certificates so that it has a simple key management. In addition, the proposed scheme can provide public verifiability, and it allows a third party to convince that the signcryption is valid for the given message without providing the receiver's private key.
Reference | Related Articles | Metrics
Cryptanalysis and improvement of an online/offline signcryption scheme
LI Zhi-min XU Xin LI Cun-hua
Journal of Computer Applications    2011, 31 (11): 2983-2985.   DOI: 10.3724/SP.J.1087.2011.02983
Abstract1025)      PDF (471KB)(500)       Save
Liu's online/offline signcryption scheme (LIU J K, BAEK J, ZHOU J. Online/offline identity-based signcryption re-visited. Inscrypt'10: Proceedings of the 6th International Conference on Information Security and Cryptology. Berlin: Springer-Verlag, 2010:90-102) was cryptanalyzed and improved in this paper. By studying the unforgeability of Liu's scheme, this paper proved that Liu's scheme would be not unforgeable against adaptive chosen message and identity attack. To overcome the security problem in Liu's scheme, a modified scheme was proposed, and the modified scheme was proved to be a secure Identity-based online/offline signcryption scheme.
Related Articles | Metrics
Image segmentation based on fast converging loopy belief propagation algorithm
Sheng-jun XU Xin LIU Liang ZHAO
Journal of Computer Applications    2011, 31 (08): 2229-2231.   DOI: 10.3724/SP.J.1087.2011.02229
Abstract1741)      PDF (682KB)(754)       Save
Large-scale computing and high mis-classification rate are two disadvantages of Loopy Belief Propagation (LBP) algorithm for image segmentation. A fast image segmentation method based on LBP algorithm was proposed. At first, a local region Gibbs energy model was built up. Then the region messages were propagated by LBP algorithm. In order to improve the running speed for LBP algorithm, an efficient speedup technique was used. At last, the segmentation result was obtained by the Maximum A Posterior (MAP) criterion of local region Gibbs energy. The experimental results show that the proposed algorithm not only obtains more accurate segmentation results, especially to noise or texture image, but also implements more fast.
Reference | Related Articles | Metrics
Anonymous fingerprinting scheme with straight-line extractors
Xin LIU
Journal of Computer Applications    2011, 31 (08): 2187-2191.   DOI: 10.3724/SP.J.1087.2011.02187
Abstract1044)      PDF (939KB)(746)       Save
Until now, fingerprinting scheme based on anonymous group signature construction has not yet been solved. To solve this problem, an anonymous fingerprinting scheme with straight-line extractors was proposed, which incorporated the technique of the Canard-Gouget-Hufschmitt zero-knowledge proof (CANARD S, GOUGET A, HUFSCHMITT E. A handy multi-coupon system. ACNS 2006: Proceedings of the 4th International Conference on Applied Cryptography and Network Security, LNCS 3989. Berlin: Springer-Verlag, 2006: 66-81) of the OR statement, the Chida-Yamamoto batch zero-knowledge proof and verification (CHIDA K, YAMAMOTO G. Batch processing for proofs of partial knowledge and its applications. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008, E91-A(1): 150-159), and the straight-line extractable commitment scheme of Arita (ARITA S. A straight-line extractable non-malleable commitment scheme. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007, E90-A(7): 1384-1394). To note that, one of the salient features of the new scheme was supporting concurrent registration, so it was especially suitable to be deployed over the Internet. Moreover, the proposed scheme had straight-line extractors, i.e., the security reduction algorithm did not depend on inefficient rewinding strategy and got tight security reduction. Formal security analysis shows that the proposed scheme achieves all the properties required by anonymous fingerprinting schemes.
Reference | Related Articles | Metrics